Taxonomies of networks from community structure
نویسندگان
چکیده
منابع مشابه
Taxonomies of networks from community structure.
The study of networks has become a substantial interdisciplinary endeavor that encompasses myriad disciplines in the natural, social, and information sciences. Here we introduce a framework for constructing taxonomies of networks based on their structural similarities. These networks can arise from any of numerous sources: They can be empirical or synthetic, they can arise from multiple realiza...
متن کاملDeriving Taxonomies from Automatic Analysis of Group Membership Structure in Large Social Networks
We develop a method to create taxonomies in large social networks solely based on users group membership information. We illustrate our technique using an example of the Flickr photo sharing network. This photo sharing community is a social network that enables users to collectively store digital pictures, interact and form groups of interest. Based on our earlier research of success indicators...
متن کاملCompact, evolving community taxonomies using concept lattices
We introduce a formal framework based on formal concept lattices, or Galois lattices, that categorizes epistemic communities automatically and hierarchically, rebuilding a relevant taxonomy in the form of a hypergraph of significant epistemic sub-communities. The longitudinal study of these static pictures makes historical description possible, by capturing epistemological descriptions through ...
متن کاملDetecting community structure in networks
There has been considerable recent interest in algorithms for finding communities in networks— groups of vertices within which connections are dense, but between which connections are sparser. Here we review the progress that has been made towards this end. We begin by describing some traditional methods of community detection, such as spectral bisection, the Kernighan–Lin algorithm and hierarc...
متن کاملOrdered community structure in networks
Community structure in networks is often a consequence of homophily, or assortative mixing, based on some attribute of the vertices. For example, researchers may be grouped into communities corresponding to their research topic. This is possible if vertex attributes have discrete values, but many networks exhibit assortative mixing by some continuous-valued attribute, such as age or geographica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2012
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.86.036104